Łukasiewicz μ - calculus Matteo Mio
نویسندگان
چکیده
The paper explores properties of Łukasiewicz μ-calculus, a version of the quantitative/probabilistic modal μ-calculus containing both weak and strong conjunctions and disjunctions from Łukasiewicz (fuzzy) logic. We show that this logic encodes the well-known probabilistic temporal logic PCTL. And we give a model-checking algorithm for computing the rational denotational value of a formula at any state in a finite rational probabilistic nondeterministic transition system.
منابع مشابه
Łukasiewicz μ-calculus
The paper explores properties of Łukasiewicz μ-calculus, a version of the quantitative/probabilistic modal μ-calculus containing both weak and strong conjunctions and disjunctions from Łukasiewicz (fuzzy) logic. We show that this logic encodes the well-known probabilistic temporal logic PCTL. And we give a model-checking algorithm for computing the rational denotational value of a formula at an...
متن کامل{\L}ukasiewicz {\mu}-calculus
The paper explores properties of the Lukasiewicz μ-calculus, or Lμ for short, an extension of Lukasiewicz logic with scalar multiplication and least and greatest fixed-point operators (for monotone formulas). We observe that Lμ terms, with n variables, define monotone piecewise linear functions from [0, 1]n to [0, 1]. Two effective procedures for calculating the output of Lμ terms on rational i...
متن کاملA Proof System for Compositional Verification of Probabilistic Concurrent Processes
We present a formal proof system for compositional verification of probabilistic concurrent processes. Processes are specified using an SOS-style process algebra with probabilistic operators. Properties are expressed using a probabilistic modal μ-calculus. And the proof system is formulated as a sequent calculus in which sequents are given a quantitative interpretation. A key feature is that th...
متن کاملTree games with regular objectives
We study tree games developed recently by Matteo Mio as a game interpretation of the probabilistic μ-calculus. With expressive power comes complexity. Mio showed that tree games are able to encode Blackwell games and, consequently, are not determined under deterministic strategies. We show that non-stochastic tree games with objectives recognisable by so-called game automata are determined unde...
متن کاملProbabilistic Modal μ-Calculus with Independent Product
The probabilistic modal μ-calculus is a fixed-point logic designed for expressing properties of probabilistic labeled transition systems (PLTS’s). Two equivalent semantics have been studied for this logic, both assigning to each state a value in the interval [0, 1] representing the probability that the property expressed by the formula holds at the state. One semantics is denotational and the o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013